Test Method for Process Deadlock Based on Graph Grammars
نویسندگان
چکیده
This paper proposes a test method for process deadlock based on graph grammars through constructing process resource diagram. Through using the construction rules, it can construct and judge the validity of the process resource diagram. Through using the test rules, it can test if there is the deadlock in the process. The method is a graphical approach; it is simple and intuitive with strong
منابع مشابه
A Hybrid Meta-heuristic Approach to Cope with State Space Explosion in Model Checking Technique for Deadlock Freeness
Model checking is an automatic technique for software verification through which all reachable states are generated from an initial state to finding errors and desirable patterns. In the model checking approach, the behavior and structure of system should be modeled. Graph transformation system is a graphical formal modeling language to specify and model the system. However, modeling of large s...
متن کاملAn Extensional Treatment of Dataflow Deadlock
We discuss deadlock in reference to a simple equational dataflow language, and devise a test (the cycle sum test) which is applied to the dependency graph of a program. We use Kahn’s extensional semantics of dataflow and give a purely extensional (non-operational) proof that no program passing the cycle sum test can ever deadlock. The proof is based on the notions of size (length) and completen...
متن کاملروشی مبتنی بر تئوری گراف جهت تعیین بهینه جزیره ها در فرآیند بازیابی
In this paper, effect of the islands number variation in restoration process is investigated and a graph based method for determination of optimum islands boundaries is presented. Also, the effect of number and location of black-start units on the restoration process is evaluated. In optimization process, objective function is minimizing Energy Not Supplied (ENS) and constraints are voltage mar...
متن کاملData Hiding Method Based on Graph Coloring and Pixel Block‘s Correlation in Color Image
An optimized method for data hiding into a digital color image in spatial domainis provided. The graph coloring theory with different color numbers is applied. To enhance thesecurity of this method, block correlations method in an image is used. Experimental results showthat with the same PSNR, the capacity is improved by %8, and also security has increased in themethod compared with other meth...
متن کاملGraph Hybrid Summarization
One solution to process and analysis of massive graphs is summarization. Generating a high quality summary is the main challenge of graph summarization. In the aims of generating a summary with a better quality for a given attributed graph, both structural and attribute similarities must be considered. There are two measures named density and entropy to evaluate the quality of structural and at...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2014